On global minimizers of quadratic functions with cubic regularization
نویسندگان
چکیده
منابع مشابه
Quadratic regularization with cubic descent for unconstrained optimization∗
Cubic-regularization and trust-region methods with worst-case first-order complexity O(ε−3/2) and worst-case second-order complexity O(ε−3) have been developed in the last few years. In this paper it is proved that the same complexities are achieved by means of a quadratic-regularization method with a cubic sufficient-descent condition instead of the more usual predicted-reduction based descent...
متن کاملCharacterizing Global Minimizers of the Difference of Two Positive Valued Affine Increasing and Co-radiant Functions
Many optimization problems can be reduced to a problem with an increasing and co-radiant objective function by a suitable transformation of variables. Functions, which are increasing and co-radiant, have found many applications in microeconomic analysis. In this paper, the abstract convexity of positive valued affine increasing and co-radiant (ICR) functions are discussed. Moreover, the ...
متن کاملBest Quadratic Approximations of Cubic Boolean Functions
The problem of computing best low order approximations of Boolean functions is treated in this paper. We focus on the case of best quadratic approximations of a wide class of cubic functions of arbitrary number of variables, and provide formulas for their efficient calculation. Our methodology is developed upon Shannon’s expansion formula and properties of best affine approximations of quadrati...
متن کاملCubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local convergence results. However, the main contribution of the paper is related to global worst-case complexity bounds for different problem classes including some nonconvex cases. It is shown that the search direction c...
متن کاملThe Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
Cubic-regularization and trust-region methods with worst-case first-order complex4 ity O(ε−3/2) and worst-case second-order complexity O(ε−3) have been developed in the last few 5 years. In this paper it is proved that the same complexities are achieved by means of a quadratic6 regularization method with a cubic sufficient-descent condition instead of the more usual predicted7 reduction based d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2018
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-018-1316-0